Linear strands of edge ideals of multipartite uniform clutters
نویسندگان
چکیده
We construct the first linear strand of minimal free resolutions edge ideals d-partite d-uniform clutters. show that such are supported on relative simplicial complexes. In case clutters have resolutions, we give an explicit and surprisingly simple description their generalizing known for Ferrers graphs hypergraphs co-letterplace ideals. As application, Lyubeznik numbers appear last column table cover ideal Betti certain Furthermore, restate a characterization which based recent arithmetically Cohen-Macaulay sets points in multiprojective spaces.
منابع مشابه
Combinatorics of Symbolic Rees Algebras of Edge Ideals of Clutters
Let C be a clutter and let I be its edge ideal. We present a combinatorial description of the minimal generators of the symbolic Rees algebra Rs(I) of I . It is shown that the minimal generators of Rs(I) are in one to one correspondence with the irreducible parallelizations of C. From our description some major results on symbolic Rees algebras of perfect graphs and clutters will follow. As a b...
متن کاملEdge ideals of clique clutters of comparability graphs and the normality of monomial ideals
Let (P,≺) be a finite poset and let G be its comparability graph. If cl(G) is the clutter of maximal cliques of G, we prove that cl(G) satisfies the maxflow min-cut property and that its edge ideal is normally torsion free. We prove that edge ideals of complete admissible uniform clutters are normally torsion free. The normality of a monomial ideal is expressed in terms of blocking polyhedra an...
متن کاملRigidity of Linear Strands and Generic Initial Ideals
Let K be a field, S a polynomial ring and E an exterior algebra over K, both in a finite set of variables. We study rigidity properties of the graded Betti numbers of graded ideals in S and E when passing to their generic initial ideals. First, we prove that if the graded Betti numbers β ii+k(S/I) = β S ii+k (
متن کاملLINEAR RESOLUTIONS of POWERS of EDGE IDEALS
We discuss the linearity of the minimal free resolution of a power of an edge ideal.
متن کاملAlgebraic and combinatorial properties of ideals and algebras of uniform clutters of TDI systems
Let C be a uniform clutter and let A be the incidence matrix of C. We denote the column vectors of A by v1, . . . , vq . Under certain conditions we prove that C is vertex critical. If C satisfies the max-flow min-cut property, we prove that A diagonalizes over Z to an identity matrix and that v1, . . . , vq form a Hilbert basis. We also prove that if C has a perfect matching such that C has th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Pure and Applied Algebra
سال: 2021
ISSN: ['1873-1376', '0022-4049']
DOI: https://doi.org/10.1016/j.jpaa.2021.106690